Computing complex and real tropical curves using monodromy

Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials with constant coefficients. These algorithms rely on homotopy continuation, monodromy loops, and Cauchy integrals. Several examples are presented which are computed using an implementation that builds on the numerical algebraic geometry software Bertini.     

Interior and boundary continuity of the solution of the singular equation (β(u))t=Lu

We extend some results of DiBenedetto and Vespri (Arch. Rational Mech. Anal 132(3) (1995) 247) proving the interior and boundary continuity of bounded solutions of the singular equation $\text{(β(u))}{}_{\mathrm{t}}\text{=}\text{L}\text{u}$ where $\text{L}$ is a second order elliptic operator with bounded measurable coefficients that depend both on space and time in a proper way.     

Three-dimensional elliptic solvers for interface problems and applications

Second-order accurate elliptic solvers using Cartesian grids are presented for three-dimensional interface problems in which the coefficients, the source term, the solution and its normal flux may be discontinuous across an interface. One of our methods is designed for general interface problems with variable but discontinuous coefficient. The scheme preserves the discrete maximum principle using constrained optimization techniques. An algebraic multigrid solver is applied to solve the discrete system. The second method is designed for interface problems with piecewise constant coefficient. The method is based on the fast immersed interface method and a fast 3D Poisson solver. The second method has been modified to solve Helmholtz/Poisson equations on irregular domains. An application of our method to an inverse interface problem of shape identification is also presented. In this application, the level set method is applied to find the unknown surface iteratively.     

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

We consider a satellite following orbits around the earth in order to take shots corresponding to images requested by various customers. The daily operations of such a satellite consist of defining a feasible and satisfactory shot sequence. This problem involves both combinatorial and multiple criteria difficulties. Indeed, the number of feasible shot sequences grows significantly with the number of images asked for, and the evaluation of a shot sequence is based on several conflicting criteria. We propose to formulate this problem as the selection of a multiple criteria path in a graph without circuit. Our approach for solving this problem involves two stages: generation of efficient paths and selection of a satisfactory path using a multiple criteria interactive procedure.     

Exponentially small splitting of separatrices for area-preserving maps

We discuss some recent lower and upper bounds for the splitting of separatrices for close-to-identity area-preserving maps.     

The effects of accelerating lane in the on-ramp system

Usually there is an accelerating lane as an on-ramp merges with the main road. How the length of this section and the traffic regulations influence the traffic behaviors has seldom been investigated. In this paper, we study this issue using the cellular automata traffic flow model. We find that (i) the permission of lane changing from main road to the accelerating lane will deteriorate the capacity of the road, hence it should be forbidden; (ii) when lane changing from main road to accelerating lane is forbidden, the introduction of an accelerating lane can improve the capacity of the on-ramp system.     

A study of predator–prey models with the Beddington–DeAnglis functional response and impulsive effect

In this paper, the predator–prey system with the Beddington–DeAngelis functional response is developed, by introducing a proportional periodic impulsive catching or poisoning for the prey populations and a constant periodic releasing for the predator. The Beddington–DeAngelis functional response is similar to the Holling type II functional response but contains an extra term describing mutual interference by predators. This model has the potential to protect predator from extinction, but under some conditions may also lead to extinction of the prey. That is, the system exists a locally stable prey-eradication periodic solution when the impulsive period satisfies an inequality. The condition for permanence is established via the method of comparison involving multiple Liapunov̀ functions. Further, by numerical simulation method the influences of the impulsive perturbations and mutual interference by predators on the inherent oscillation are investigated. With the increasing of releasing for the predator, the system appears a series of complex phenomenon, which include (1) period-doubling, (2) chaos attractor, (3) period-halfing. (4) non-unique dynamics (meaning that several attractors coexist).     

The Pearson system of utility functions

This paper describes a parametric family of utility functions for decision analysis. The parameterization embeds the HARA class in a four-parameter representation for the risk aversion function. The resulting utility functions can have only four shapes: concave, convex, S-shaped, and reverse S-shaped. This makes the family suited for both expected utility and prospect theory. The paper also describes an alternative technique to estimate the four parameters from elicited utilities, which is simpler than standard fitting by minimization of the mean quadratic error.     

Two novel synchronization criterions for a unified chaotic system

Two novel synchronization criterions are proposed in this paper. It includes drive–response synchronization and adaptive synchronization schemes. Moreover, these synchronization criterions can be applied to a large class of chaotic systems and are very useful for secure communication.